Rational Minimax Iterations for Computing the Matrix pth Root
نویسندگان
چکیده
منابع مشابه
A Family of Rational Iterations and Its Application to the Computation of the Matrix pth Root
Matrix fixed-point iterations zn+1 = ψ(zn) defined by a rational function ψ are considered. For these iterations a new proof is given that matrix convergence is essentially reduced to scalar convergence. It is shown that the principal Padé family of iterations for the matrix sign function and the matrix square root is a special case of a family of rational iterations due to Ernst Schröder. This...
متن کاملRegions of convergence of a Padé family of iterations for the matrix sector function and the matrix pth root
In this paper we prove a conjecture on a common region of a convergence of Padé iterations for the matrix sector function. For this purpose we show that all Padé approximants to a special case of hypergeometric function have a power series expansion with positive coefficients. Using a sharpened version of Schwarz’s lemma, we also demonstrate a better estimate of the convergence speed. Our resul...
متن کاملSome Formulas for the Principal Matrix pth Root
In this paper we project to develop two methods for computing the principal matrix pth root. Our approach makes use of the notion of primary matrix functions and minimal polynomial. Therefore, compact formulas for the principal matrix pth root are established and significant cases are explored. Mathematics Subject Classification: Primary 15A24, 15A99, 65H10 Secondary 15A18
متن کاملFunctions Preserving Matrix Groups and Iterations for the Matrix Square Root
For which functions f does A ∈ G ⇒ f(A) ∈ G when G is the matrix automorphism group associated with a bilinear or sesquilinear form? For example, if A is symplectic when is f(A) symplectic? We show that group structure is preserved precisely when f(A) = f(A) for bilinear forms and when f(A) = f(A) for sesquilinear forms. Meromorphic functions that satisfy each of these conditions are characteri...
متن کاملA Schur Algorithm for Computing Matrix pth Roots
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized version of Newton’s method, but this iteration has poor convergence and stability properties in general. A Schur algorithm for computing a matrix pth root that generalizes methods of Björck and Hammarling [Linear Algebra Appl., 52/53 (1983), pp. 127–140] and Higham [Linear Algebra Appl., 88/89 (1987),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constructive Approximation
سال: 2020
ISSN: 0176-4276,1432-0940
DOI: 10.1007/s00365-020-09504-3